package com.gmail.sabuj.career.qna.core;

public class MaxValue {

	
	public static int[] thirdMax(int[] a){
		int m1=0, m2=0, m3=0;
		
		for (int i = 0; i < a.length; i++) {
			int x1 = a[i-2];
			int x2 = a[i-1];
			int x3 = a[i];
			
			int max = Math.max(x1, Math.max(x2, x3));
			int min = Math.min(x1, Math.min(x2, x3));
			
			
		}
		
		return new int[]{m1,m2,m3};
	}
	
	public static int[] max(int[] a, int k){
		int[] maxarray = new int[k];
		
		
		
		return maxarray;
	}
	
	public void buildMaxHeap(int [] a){
		for(int i=a.length/2; i>=0; i--)
			maxHeapify(a, i);
	}
	
	public void maxHeapify(int[] a, int index){
		int left = 2 * index + 1;
		int ritht = 2 * index + 2;
		int max;
		
	}
	
}
